منابع مشابه
Classifying Descents According to Parity
In this paper we refine the well-known permutation statistic “descent” by fixing parity of (exactly) one of the descent’s numbers. We provide explicit formulas for the distribution of these (four) new statistics. We use certain differential operators to obtain the formulas. Moreover, we discuss connection of our new statistics to the Genocchi numbers. We also provide bijective proofs of some of...
متن کاملClassifying Descents According to Equivalence mod k
In [5] the authors refine the well-known permutation statistic “descent” by fixing parity of (exactly) one of the descent’s numbers. In this paper, we generalize the results of [5] by studying descents according to whether the first or the second element in a descent pair is equivalent to k mod k ≥ 2. We provide either an explicit or an inclusion-exclusion type formula for the distribution of t...
متن کامل6 Classifying Descents According to equivalence mod k
In [5] the authors refine the well-known permutation statistic “descent” by fixing parity of (exactly) one of the descent’s numbers. In this paper, we generalize the results of [5] by studying descents according to whether the first or the second element in a descent pair is equivalent to k mod k ≥ 2. We provide either an explicit or an inclusion-exclusion type formula for the distribution of t...
متن کاملClassifying Documents According to Locational Relevance
This paper presents an approach for categorizing documents according to their implicit locational relevance. We report a thorough evaluation of several classifiers designed for this task, built by using support vector machines with multiple alternatives for feature vectors. Experimental results show that using feature vectors that combine document terms and URL n-grams, with simple features rel...
متن کاملClassifying ASR Transcriptions According to Arabic Dialect
We describe several systems for identifying short samples of Arabic dialects, which were prepared for the shared task of the 2016 DSL Workshop (Malmasi et al., 2016). Our best system, an SVM using character tri-gram features, achieved an accuracy on the test data for the task of 0.4279, compared to a baseline of 0.20 for chance guesses or 0.2279 if we had always chosen the same most frequent cl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Combinatorics
سال: 2007
ISSN: 0218-0006,0219-3094
DOI: 10.1007/s00026-007-0313-2